Planar Strong Visibility
نویسندگان
چکیده
The study of nontraditional notions of visibility and convexity is a fruitful branch of geometry, which has found applications in vlsi design, graphics, and motion planning. Researchers have investigated multiple variations of these notions, including orthogonal, finitely oriented, and restricted-orientation visibility and convexity, as well as nesw and link convexity. Rawlins introduced the notions of strong visibility and convexity in his doctoral dissertation, as part of his research on restricted-orientation geometry. Rawlins and Wood studied strongly convex sets, and demonstrated that they generalize not only standard convexity, but also the notions of ortho-rectangles and C-oriented polygons. We extended restricted-orientation geometry to higher dimensions and reported the results in a series of articles. Martynchik, Metelski, Rawlins, Schuierer, and Wood explored computational problems in restricted-orientation geometry and developed a suite of related
منابع مشابه
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
A graph is called a strong ( resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp. a subset of) the pairs of vertices whose bars have a -thick vertical line connecting them that intersects at most one other bar. We explore the relation among weak (resp. strong) bar 1-visibility graphs and other nearly pl...
متن کامل3 Lower Bounds on the Numberings
A visibility representation of a graph maps vertices to horizontal segments and edges to vertical segments. For a weak-visibility representation, if the vertices of the original graph are adjacent, the corresponding segments will ’see’ each other. For a strong-visibility representation, the converse is true as well. Here we present a detailed step-by-step construction of a weak-visibility repre...
متن کامل1-Visibility Representations of 1-Planar Graphs
A visibility representation is a classical drawing style of planar graphs. It displays the vertices of a graph as horizontal vertexsegments, and each edge is represented by a vertical edge-segment touching the segments of its end vertices; beyond that segments do not intersect. We generalize visibility to 1-visibility, where each edge(vertex-) segment crosses at most one vertex(edge-) segment. ...
متن کاملVisibility Drawings of Plane 3-Trees with Minimum Area
A visibility drawing of a plane graph G is a drawing of G where each vertex is drawn as a horizontal line segment and each edge is drawn as a vertical line segment such that the line segments use only grid points as their endpoints. The area of a visibility drawing is the area of the smallest rectangle on the grid which encloses the drawing. A minimum-area visibility drawing of a plane graph G ...
متن کاملOn a planar matching in line segments endpoints visibility graph
We show that the segment endpoint visibility graph of any finite set of 2n line segments contains a planar matching that does not use any segment edge, if the line segments in our set are convexly independent.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 13 شماره
صفحات -
تاریخ انتشار 2003